Quantum complexity theory - PDFSEARCH.IO - Document Search Engine

Quantum complexity theory
Results: 258

#	Item
171	Document: Final Rule, Register Page Number: 29 IR 799 Source: December 1, 2005, Indiana Register, Volume 29, Number 3 Disclaimer: This document was created from the files used to produce the official CD-ROM Indiana Regis Add to Reading List Source URL: www.in.gov Language: English - Date: 2007-03-16 15:56:50 QMA Quantum complexity theory
172	Adequate Yearly Progress (AYP[removed]School Year[removed] Add to Reading List Source URL: www.eed.state.ak.us Language: English - Date: 2004-04-22 22:22:38 PP Quantum complexity theory
173	A new exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, Add to Reading List Source URL: www.lu.lv Language: English - Date: 2011-06-10 03:41:08 Computational complexity theory Communication Cryptography Communication complexity Quantum complexity theory Complexity Quantum entanglement Decision tree model Theoretical computer science Quantum information science Applied mathematics
174	Quantum algorithms for search with wildcards and combinatorial group testing arXiv:1210.1148v4 [quant-ph] 20 May[removed]Andris Ambainis∗ and Ashley Montanaro† Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-20 20:17:48 Quantum algorithms Combinatorics Quantum information science Computational complexity theory Group testing Decision tree model FO Amplitude amplification Deutsch–Jozsa algorithm Theoretical computer science Mathematics Applied mathematics
175	Almost all decision trees do not allow significant quantum speed-up Ashley Montanaro∗ arXiv:1209.4781v1 [quant-ph] 21 Sep[removed]September 24, 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-09-23 20:07:50 Models of computation Quantum information science Decision tree model Quantum algorithm PP Randomized algorithm Binary tree Quantum computer Random binary tree Theoretical computer science Applied mathematics Computational complexity theory
176	How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?∗ arXiv:1206.0717v2 [quant-ph] 25 Mar[removed]Andris Ambainis† Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-03-25 21:05:57 Computational complexity theory Quantum information science Analysis of algorithms Quantum algorithm Decision tree model Circuit complexity FO Communication complexity Big O notation Theoretical computer science Applied mathematics Mathematics
177	Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-12-19 23:31:39 Quantum complexity theory Models of computation Turing machine PostBQP PP Quantum Turing machine Probabilistic Turing machine RL Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
178	Parameterized Quantum Query Complexity of Graph Collision ? Andris Ambainis, Kaspars Balodis, J¯anis Iraids, Raitis Ozols, and Juris Smotrovs arXiv:1305.1021v1 [quant-ph] 5 May 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-06 20:20:50 Tree Minor Graph Connectivity Path decomposition Dominating set Graph theory Tree decomposition NP-complete problems
179	A composition theorem for decision tree complexity Ashley Montanaro∗ Centre for Quantum Information and Foundations, DAMTP, University of Cambridge, UK. arXiv:1302.4207v1 [cs.CC] 18 Feb 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-02-18 20:19:36 Communication Communication complexity Computational complexity theory Quantum complexity theory Quantum information science Convolution theorem Mathematics Mathematical analysis Calculus
180	Classical simulation complexity of extended Clifford circuits arXiv:1305.6190v1 [quant-ph] 27 May[removed]Richard Jozsa1 and Maarten Van den Nest2 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-27 20:17:13 Quantum information science Complexity classes Models of computation Circuit complexity Quantum computer Quantum circuit Gottesman–Knill theorem Quantum error correction BQP Theoretical computer science Applied mathematics Computational complexity theory

UPDATE